#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;

int main()
{
	unordered_set<int> set_unordered;
	int old_count = set_unordered.bucket_count();
	cout << "count: " << old_count << endl;
	for (size_t i = 0; i < 100000; i++)
	{
		set_unordered.insert(i);
		if (old_count != set_unordered.bucket_count())
		{
			old_count = set_unordered.bucket_count();
			cout << "count: " << old_count << endl;
		}
	}
	return 0;
}
